Hypothetical Reasoning in Possibilistic Logic: Basic Notions, Applications and Implementation Issues
نویسندگان
چکیده
Possibilistic ATMS are truth maintenance systems oriented towards hypothetical reasoning where both assumptions and justifications can bear an uncertainty weight. Uncertainty is represented in the framework of possibility theory. In possibilistic logic uncertain clauses are handled as such and then in possibilistic ATMS the management of uncertainty is not separated from the other classical capabilities of the ATMS. The main interest of a possibilistic ATMS is to take advantage of the uncertainty pervading the available knowledge so as to rank-order environments in which a given statement is true. The approach is illustrated on a fault diagnosis problem. Basic algorithms associated with possibilistic ATMS are given.
منابع مشابه
COMBINING HYPOTHETICAL REASONING a n d PLAUSIBLE INFERENCE IN POSSIBILISTIC LOGIC*
Possibilistic logic provides an efficient tool for handling uncertain and nonmonotonic reasoning on the one hand, and for hypothetical reasoning on the other hand. In the first situation, logic formulas are simply weighted by lower bounds of a necessity measure. Thus, formulas in a knowledge base are rank-ordered according to their levels of certainty. In the case of hypothetical reasoning, the...
متن کاملPossibilistic Safe Beliefs vs. Possibilistic Stable Models
In any learning process, the learners arrive with a great deal of variables, such as their different learning styles, their affective states and their previous knowledge, among many others. In most cases, their previous knowledge is incomplete or it comes with a certain degree of uncertainty. Possibilistic Logic was developed as an approach to automated reasoning from uncertain or prioritized i...
متن کاملA possibilistic handling of partially ordered information
In standard possibilistic logic, prioritized in formation are encoded by means of weighted knowledge bases. This paper proposes an exten sion of possibilistic logic to deal with partially ordered information which can be viewed as a family of possibilistic knowledge bases. We show that all basic notions of possibilis tic logic have natural counterparts when dealing with partially ordered inf...
متن کاملPossibilistic logic: a retrospective and prospective view
Possibilistic logic is a weighted logic introduced and developed since the mid-1980s, in the setting of arti(cial intelligence, with a view to develop a simple and rigorous approach to automated reasoning from uncertain or prioritized incomplete information. Standard possibilistic logic expressions are classical logic formulas associated with weights, interpreted in the framework of possibility...
متن کاملExtending possibilistic logic over Gödel logic
In this paper we present several fuzzy logics trying to capture different notions of necessity (in the sense of Possibility theory) for Gödel logic formulas. Based on different characterizations of necessity measures on fuzzy sets, a group of logics with Kripke style semantics are built over a restricted language, namely a two level language composed of non-modal and modal formulas, the latter ...
متن کامل